inversion table directions

, don't just think about 1, that's not good.Note:prefix and want to use LL, however the topic int also no problem#include #include#include#include#includeusing namespaceStd;typedefLong Longll;Const intn=1e7+5, mod=20101009; inlineintRead () {CharC=GetChar (); intx=0, f=1; while(c'0'|| C>'9'){if(c=='-') f=-1; c=GetChar ();} while(c>='0'c'9') {x=x*Ten+c-'0'; c=GetChar ();} returnx*F;}intn,m;BOOLNotp[n];intP[n];ll S[n],mu[n];voidSieveintN) {mu[1]=1; for(intI=2; i){ if(!notp[i]) p[++p[0]]=

; - Else -Sum[su[j]*i]= (Sum[su[j]]*sum[i])%MOD; - } in } - for(i=1; i) toSum[i]= (sum[i]+sum[i-1])%MOD; + } - ll S (ll X,ll y) the { * return(ll) (X* (x+1)/2%MOD) * (LL) (y* (y+1)/2%MOD)%MOD); $ }Panax Notoginseng - intMain () the { + //freopen ("in.in", "R", stdin); A //freopen ("Out.out", "w", stdout); themx=1e7; + Get_mu (); - intT scanf"%d",T); $ while(t--) { $scanf"%d%d",n,m); - if(n>m) swap (n,m); -mx=N; get_mu (); the int

Run the code first. Void reverse (list * head) {list * P, * TMP; P = head-> next; // P points to the node currently being processed TMP = p-> next; // TMP points to the first node that has not been processed p-> next = NULL; // The first node of the original single linked list will become the last node after the inversion head-> next = P; // insert P = TMP behind the header of the single-chain table; //

*/L=NULL; Else{L= (List)malloc(sizeof(Node)); L->data=e; Creatlist (L-next); }}voidTraverselist (List l)/*Traverse, print linked list*/{ while(L) {cout" "; L=l->Next; };}voidReverselist (List l)/*Reverse Operation*/{List q,p,r; P=L; Q=p->Next; P->next=null;/*turn the head knot into a tail knot.*/ while(Q!=null)/*cursor Q, r with L operation*/{R=q->Next; Q->next=m; L=Q; Q=R; }}voidDestorylist (List l)/*destroyed*/{ if(l) {List (l-next); Free(L); L=NULL; }}intMainvoid) {List L; Creatli

In order to represent the logical relationship between each data element AI and its immediate successor element Ai+1, the data AI, in addition to storing its own information, also needs to store a message indicating its immediate successor (i.e., the immediate successor storage location). These two pieces of information form the storage image of the data element AI, known as node (node). n node chains form a linked list, which is a chain-type storage structure for the linear